A New Parallel Algorithm for Planarity Testing
نویسندگان
چکیده
This paper presents a new parallel algorithm for planarity testing based upon the work of Klein and Reif [14]. Our new approach gives correct answers on instances that provoke false positive and false negative results using Klein and Reif’s algorithm. The new algorithm has the same complexity bounds as Klein and Reif’s algorithm and runs in O ( n log n p ) time for any number p ≤ n processors of a Concurrent Read Exclusive Write (CREW) Parallel RAM (PRAM). Implementations of the major steps of this parallel algorithm exist for symmetric multiprocessors and exhibit speedup when compared to the best sequential approach. Thus, this new parallel algorithm for planarity testing lends itself to a high-performance shared-memory implementation.
منابع مشابه
A New Parallel Algorithm for Planarity Testing
Determining whether a graph is planar is both theoretically and practically interesting. Although several sequential algorithms have been introduced which accomplish planarity testing in O(V ) time for graphs with V vertices, very few of these have been parallelized. In a recent comparison of sequential planarity testing algorithms, the newest algorithms were found to be fastest; however, these...
متن کاملOptimal Upward Planarity Testing of Single-Source Digraphs
A digraph is upward planar if it has a planar drawing such that all the edges are monotone with respect to the vertical direction. Testing upward planarity and constructing upward planar drawings is important for displaying hierarchical network structures, which frequently arise in software engineering, project management, and visual languages. In this paper we investigate upward planarity test...
متن کاملAn Efficient Parallel Algorithm for Planarity by Philip
We describe a parallel algorithm for testing a graph for planarity, and for finding an embedding of a planar graph. For a graph on n vertices, the algorithm runs in O(log2 n) steps on n processors of a parallel RAM. The previous best algorithm for planarity testing in parallel polylog time ([Ja'Ja' and Simon, 82]) used a reduction to solving linear systems, and hence required fl(n2 49 ) process...
متن کاملCoarse Grained Parallel Graph Planarity Testing
We present a coarse grained parallel algorithm for planarity testing and planar embedding. The algorithm requires O(log p) communication rounds and linear sequential work per round. It assumes that the local memory per processor, N=p, is larger than p for some xed > 0. This assumption is true for all commercially available multiprocessors. Our result implies a BSP algorithm with O(log p) supers...
متن کاملUpward Spirality and Upward Planarity Testing
The upward planarity testing problem is known to be NPhard. We describe an O(n)-time upward planarity testing and embedding algorithm for the class of digraphs that do not contain rigid triconnected components. We also present a new FPT algorithm that solves the upward planarity testing and embedding problem for general digraphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003